Budget Tracking in a Differentially Private Database System

ABSTRACT

Techniques are described for budget tracking in a differentially private security system. A request to perform a query of a private database system is received by a privacy device from a client device. The request is associated with a level of differential privacy. A privacy budget corresponding to the received request is accessed by the privacy device. The privacy budget includes a cumulative privacy spend and a maximum privacy spend, the cumulative privacy spend representative of previous queries of the private database system. A privacy spend associated with the received request is determined by the privacy device based at least in part on the level of differential privacy associated with the received request. If a sum of the determined privacy spend and the cumulative privacy spend is less than the maximum privacy spend, the query is performed. Otherwise a security action is performed based on a security policy.

BACKGROUND Field of Disclosure

The present invention generally relates to a database system, and more specifically to responding to a database query by executing a differentially private version of the query on the database.

Description of the Related Art

Personally identifiable information, such as health data, financial records, telecom data, and confidential business intelligence, such as proprietary data or data restricted by contractual obligations, is valuable for analysis and collaboration. Yet, only a fraction of such sensitive information is used by organizations or analysts for statistical or predictive analysis. Privacy regulations, security concerns, and technological challenges suppress the full value of data, especially personally identifiable information and confidential and proprietary records.

Methods that attempt to solve this problem, such as access controls, data masking, hashing, anonymization, aggregation, and tokenization, are invasive and resource intensive, compromise analytical utility, or do not ensure privacy of the records. For example, data masking may remove or distort data, compromising the statistical properties of the data. As another example, many of the above mentioned methods are not effective when information is stored in disparate data sources. Technology which enables organizations or analysts to execute advanced statistical and predictive analysis on sensitive information across disparate data sources without revealing record-level information is needed.

SUMMARY

A request to perform a query of a private database system is received by a privacy device from a client device. The request is associated with a level of differential privacy. A privacy budget corresponding to the received request is accessed by the privacy device. The privacy budget includes a cumulative privacy spend and a maximum privacy spend, the cumulative privacy spend representative of previous queries of the private database system. A privacy spend associated with the received request is determined by the privacy device based at least in part on the level of differential privacy associated with the received request. If a sum of the determined privacy spend and the cumulative privacy spend is less than the maximum privacy spend, the privacy device provides a set of results to the client device in response to the performed query and updates the cumulative privacy spend by incrementing the cumulative privacy spend by an amount equal to the determined privacy spend. Otherwise, in response to the sum of the cumulative privacy spend and the determined privacy spend being equal to or greater than the maximum privacy spend, a security policy associated with the privacy budget is accessed and a security action is performed based on the accessed security policy and the received request.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 illustrates a system for receiving a query for a private database, and for responding to the query by executing a differentially private version of the query on the private database.

FIG. 2 illustrates an example database structure, according to one embodiment.

FIG. 3 is a block diagram illustrating the privacy system of the system in FIG. 1, according to one embodiment.

FIG. 4 illustrates displaying results of a differentially private count query, according to one embodiment.

FIG. 5 illustrates an example binary decision tree for use in a differentially private random forest query, according to one embodiment.

FIG. 6 illustrates perturbing the counts for a differentially private histogram query, according to one embodiment.

FIG. 7A illustrates a recursive process for identifying threshold points of the classification output vector for a differentially private model testing query, according to one embodiment.

FIG. 7B illustrates an example confusion matrix generated during a differentially private model testing query.

FIG. 8 illustrates a system-level modification to the system of FIG. 1 that allows the client to access to a differentially private synthetic database, according to one embodiment.

FIG. 9 illustrates the application of a clustering query to entries of a differentially private synthetic database, according to one embodiment.

FIG. 10 illustrates a process for responding to a database query by executing a differentially private version of the query on the database, according to one embodiment.

FIG. 11 is a block diagram illustrating components of an example machine able to read instructions from a machine-readable medium and execute them in a processor (or controller).

FIG. 12 illustrates interactions with a differentially private database system associated with a plurality of privacy budgets, according to one embodiment.

FIG. 13 illustrates a process for tracking a privacy budget in a differentially private database system, according to one embodiment.

FIG. 14 illustrates an example database projection relational operator, according to one embodiment.

FIG. 15 illustrates an example database selection relational operator, according to one embodiment.

FIG. 16 illustrates an example database union relational operator, according to one embodiment.

FIG. 17 illustrates an example database join relational operator, according to one embodiment.

DETAILED DESCRIPTION

The Figures (FIGS.) and the following description describe certain embodiments by way of illustration only. One skilled in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles described herein. Reference will now be made in detail to several embodiments, examples of which are illustrated in the accompanying figures. It is noted that wherever practicable similar or like reference numbers may be used in the figures and may indicate similar or like functionality.

System Overview

FIG. 1 is a system 100 for receiving a query 108 for a private database 106, and responding to the query 108 by executing a differentially private (DP) version of the query 114 on the private database 106. The system 100 includes a differentially private security system 102 that receives the analytical query 108 from a client 104 and applies a DP version of the query 114 on the database 106. Subsequently, the differentially private security system 102 returns the response of the DP query 114 to the client 104 as the DP response 112.

The database 106 is one or more private databases managed by one or more entities that can only be accessed by authorized or trusted users. For example, the database 106 may contain health data of patients, financial records, telecom data, and confidential business intelligence, such as proprietary data or data restricted by contractual obligations. The information stored in the database 106 is of interest to one or more clients 104, but clients 104 may not have the necessary authorization to access to information contained in the databases 106.

FIG. 2 illustrates an example database structure, according to one embodiment. For the remainder of the application, a database, including one or more of the private databases 106, may be referred to as a matrix with a number of rows and columns. Each row is an entry of the database and each column is a feature of the database. Thus, each row contains a data entry characterized by a series of feature values for the data entry. For example, as shown in FIG. 2, the example database 200 contains 8 entries and 11 features, and illustrates a list of patient profiles. Each patient is characterized by a series of feature values that contain information on the patient's height (Feature 1), country of residence (Feature 2), age (Feature 10), and whether the patient has contracted a disease (Feature 11).

The feature values may be numerical in nature, e.g., Features 1 and 10, or categorical in nature, e.g., Features 2 and 11. In the case of categorical feature values, each category may be denoted as an integer. For example, in Feature 11 of FIG. 2, “0” indicates that the patient has not contracted a disease, and “1” indicates that the patient has contracted a disease.

Returning to FIG. 1, the client 104 may be a human analyst or an organization that does not have direct access to the database 106, but is interested in applying an analytical query 108 to the database 106. For example, the client 104 may be a data analyst, data scientist, or a health analyst that is interested in the profiles of the patients but does not have direct access to the database 106. Each client 104 of the system 100 is associated with a privacy budget and specifies a set of privacy parameters each time the client 104 submits a query 108. The privacy budget is a numerical value representative of a number and/or type of remaining queries 108 available to the client 104 in terms of the privacy parameters specified for each query 108.

The query 108 submitted by the client 104 may be simple queries, such as count queries that request the number of entries in the databases 106 that satisfy a condition specified by the client 104, or complicated queries, such as predictive analytics queries that request a data analytics model trained on the databases 106. Upon submitting a query 108 to the differentially private security system 102, the client 104 receives a DP response 112 to a differentially private version of the submitted query 114.

The client 104 specifies a set of privacy parameters each time the client 104 submits query 108. The privacy parameters indicate an amount of decrease in the privacy budget of the client 104 in return for a response to the query 108. As described below in more detail with reference to the privacy system 160 in FIG. 3, the privacy parameters specified by the client 104 also indicate the amount of information released about the database 106 to the client 104.

The differentially private security system 102 receives an analytical query 108 from the client 104 and applies a differentially private version of the query 114 on the database 106, such that it releases a degree of information about the database 106 indicated by the privacy parameters specified by the client 104, but also protects a degree of privacy of the databases 106 specified by the entities managing the database 106. For example, the entities managing the database 106 may also set a maximum threshold on the degree of information released about the database 106 for a given query 108 that the client 104 may not exceed. Thus, the differentially private security system balances privacy protection of the database 106 while releasing useful information on the database 106 to the client 104. The differentially private security system 102 may have complete or partial access to the databases 106.

Upon receiving a query 108, the differentially private security system 102 applies DP query 114 to the database 106 and returns a DP response 112 to the client 104. The DP query 114 is a differentially private version of the query 108 that satisfies a definition of differential privacy described in more detail with reference to the privacy system 160 in FIG. 3. The DP query 114 may include perturbing the response or output of the query 108 with noise, or perturbing the process for generating the output of the query 108 with noise. The resulting output of the DP query 114 is returned to the client 104 as DP response 112. Ideally, the DP response 112 correlates to the original output of the query 108 on the databases 106 but maintains the degree of privacy specified by the entities managing the database 106.

Differentially Private Security System

The differentially private security system 102 includes a user interface 150, a library 152, an account management system 154, a query handling engine 156, a data integration module 158, and a privacy system 160. Some embodiments of the differentially private security system 102 have different or additional modules than the ones described here. Similarly, the functions can be distributed among the modules in a different manner than is described here. Certain modules and functions can be incorporated into other modules of the differentially private security system 102.

The user interface 150 can generate a graphical user interface on a dedicated hardware device of the differentially private security system 102 or the client 104 in which the client 104 can submit an analytical query 108 and the desired privacy parameters, and view DP response 112 in the form of numerical values or images. The client 104 may also inspect database 106 schemata, view an associated privacy budget, or cache the DP response 112 to view the response later. The user interface 150 submits properly formatted query commands to other modules of the differentially private security system 102.

The library 152 contains software components that can be included in external programs that allow the client 104 to submit the analytical query 108, receive the DP response 112, and other functions within a script or program. For example, the client 104 may use the software components of the library 152 to construct custom data analytic programs. Each of the software components in the library 152 submits properly formatted query commands to other modules of the differentially private security system 102.

The account management system 154 receives properly formatted query commands (herein “query commands” or “QC”), parses the received query commands, and updates the account of the client 104 according to the received query command. For example, the account management system 154 may check the query commands for syntactic correctness, or check whether a client 104 has access to a requested resource. As another example, the account management system 154 may check whether the privacy parameters specified by the client 104 for a given analytical query 108 can be accommodated, and if so, decrement the privacy budget of the client 104 by the amount specified in the query 108. Query commands verified by the account management system 154 are provided to the query handling engine 156. Examples of query commands accommodated by the differentially private security system 102 are listed below.

QC1. Count ‘SELECT COUNT (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC2. Median ‘SELECT MEDIAN (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC3. Mean ‘SELECT MEAN (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC4. Variance ‘SELECT VARIANCE (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC5. Inter-Quartile Range ‘SELECT IQR (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC6. Batch Gradient Descent ‘SELECT <GLM> (<columns_x>,<column_y>,<params>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC7. Stochastic Gradient Descent ‘SELECT SGD <GLM> (<column>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC8. Random Forest ‘SELECT RANDOMFOREST (<columns_x>,<columns_y>) FROM <database.table> WHERE <where_clause> BUDGET <eps> <delta>. QC9. Histogram ‘SELECT HISTOGRAM (<column>) FROM <database.table> WHERE <where_clause_i> BUDGET <eps> <delta>.

The query handling engine 156 transforms the received query commands into appropriate function calls and database access commands by parsing the query command string. The function calls are specific to the query 108 requested by the client 104, and the access commands allow access to the required database 106. Different databases 106 require different access commands. The access commands are provided to the database integrator 158.

The database integrator 158 receives the access commands to one or more databases 106 and collects the required databases 106 and merges them into a single data object. The data object has a structure similar to that of a database structure described in reference to FIG. 2. The data object is provided to the privacy system 160.

The privacy system 160 receives the data object from the database integrator 158, appropriate function calls from the query handling engine 156 indicating the type of query 108 submitted by the client 104, privacy parameters specified for the query 108, and produces a DP response 112 to a differentially private version of the query 108 with respect to the databases 106. The privacy system 160 will be described in further detail in reference to FIG. 3 below.

Privacy System

FIG. 3 is a block diagram illustrating the privacy system 160 of the system 100 shown in FIG. 1, according to one embodiment. The privacy system 160 includes a count engine 302, a mean engine 304, a median engine 306, a variance engine 308, an IQR engine 310, a batch gradient engine 312, a stochastic gradient engine 314, a random forest engine 316, a histogram engine 318, a model testing engine 320, and a synthetic database engine 322. Some embodiments of the privacy system 160 have different or additional modules than the ones described here. Similarly, the functions can be distributed among the modules in a different manner than is described here. Certain modules and functions can be incorporated into other modules of the privacy system 160.

Definition of Differential Privacy

For a given query 108, the privacy system 160 receives a data object X, function calls indicating the type of query 108, privacy parameters specified by the client 104, and outputs a DP response 112 to a differentially private version of the query 108 with respect to X. Each data object X is a collection of row vectors x_(i=1, 2, . . . , n), in which each row vector x_(i) has a series of p elements x/^(=1, 2, . . . , p).

A query M satisfies the definition of ε-differential privacy if for all:

${\forall X},{X^{\prime} \in},{\forall{S \subseteq {{{{Range}(M)}\text{:}\mspace{14mu} \frac{\Pr \left\lbrack {{M(X)} \in S} \right\rbrack}{\Pr \left\lbrack {{M\left( X^{\prime} \right)} \in S} \right\rbrack}} \leq e^{ɛ}}}}$

where

is the space of all possible data objects, X, X′ neighboring data objects, S is an output space of query M, and neighboring databases are defined as two data objects X, X′ that have at most one different entry from one another. That is, given two neighboring data objects X, X′ in which one has an individual's data entry, and the other does not, there is no output of query M that an adversary can use to distinguish between X, X′. That is, an output of such a query M that is differentially private reveals no information about the data object X. The privacy parameter ε controls the amount of information that the query M reveals about any individual data entry in X, and represents the degree of information released about the entries in X. For example, in the definition given above, a small value of ε indicates that the probability an output of query M will disclose information on a specific data entry is small, while a large value of ε indicates the opposite.

As another definition of differential privacy, a query M is (ε,δ)-differentially private if for neighboring data objects X, X′:

${\forall X},{X^{\prime} \in},{\forall{S \subseteq {{{{Range}(M)}\text{:}\mspace{14mu} \frac{\Pr \left\lbrack {{M(X)} \in S} \right\rbrack}{\Pr \left\lbrack {{M\left( X^{\prime} \right)} \in S} \right\rbrack}} \leq {e^{ɛ} + {\delta.}}}}}$

The privacy parameter δ measures the improbability of the output of query M satisfying ε-differential privacy. As discussed in reference to FIG. 1, the client 104 may specify the desired values for the privacy parameters (ε,δ) for a query 108.

There are three important definitions for discussing the privacy system 160: global sensitivity, local sensitivity, and smooth sensitivity. Global sensitivity of a query M is defined as

${{GS}_{M}(S)} = {\max\limits_{X,{{X^{\prime}:{d{({X,X^{\prime}})}}} = 1}}{{{M(X)} - {M\left( X^{\prime} \right)}}}}$

where X, X′ are any neighboring data objects, such that d(X, X′)=1. This states that the global sensitivity is the most the output of query M could change by computing M on X and X′.

The local sensitivity of a query M on the data object X is given by:

${{LS}_{M}(S)} = {\max\limits_{{X^{\prime}:{d{({X,X^{\prime}})}}} = 1}{{{M(X)} - {M\left( X^{\prime} \right)}}}}$

where the set {X′: d(X, X′)=1} denotes all data objects that have at most one entry that is different from X. That is, the local sensitivity LS_(M)(X) is the sensitivity of the output of the query M on data objects X′ that have at most one different entry from X, measured by a norm function.

Related to the local sensitivity LS_(M)(X), the smooth sensitivity given a parameter β is given by:

S_(M)(X; β) = LS_(M)(X) ⋅ e^(−β ⋅ d(X, X^(′)))

where d(X, X′) denotes the number of entries that differ between X and X′.

Notation for Random Variables

The notation in this section is used for the remainder of the application to denote the following random variables.

1) G(σ²), denotes a zero-centered Gaussian random variable with the probability density function

${f\left( x \middle| \sigma^{2} \right)} = {\frac{1}{\sigma \sqrt{2\pi}}{e^{- \frac{x^{2}}{2\sigma^{2}}}.}}$

2) L(b) denotes a zero-centered Laplacian random variable with the probability density function

${f\left( x \middle| b \right)} = {\frac{1}{2b}{e^{- \frac{x}{b}}.}}$

3) C(γ) denotes a zero-centered Cauchy random variable with the probability density function

${f\left( x \middle| \gamma \right)} = {\frac{1}{\pi \; {\gamma \left( {1 + \left( \frac{x}{\gamma} \right)^{2}} \right)}}.}$

Further, a vector populated with random variables R as its elements is denoted by v(R). A matrix populated with random variables R as its elements is denoted by M(R).

Count Engine 302

The count engine 302 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for counting the number of entries in a column of the data object X that satisfy a condition specified by the client 104, given privacy parameters (ε,δ). An example query command for accessing the count engine 302 is given in QC1 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for the number of patients that are above the age of 30.

The count engine 302 retrieves the count q from X. If privacy parameter δ is equal to zero, the count engine 302 returns

${y \approx {q + {L\left( {c_{1} \cdot \frac{1}{\epsilon}} \right)}}},$

as the DP response 112 for display on the user interface 150, where c₁ is a constant. An example value for c₁ may be 1. If the privacy parameter δ is non-zero, the count engine 302 returns

${y \approx {q + {G\left( {{c_{1} \cdot 2 \cdot \log}{\frac{2}{\delta} \cdot \frac{1}{\epsilon^{2}}}} \right)}}},$

as the DP response 112 for display on the user interface 150, where c₁ is a constant. An example value for c₁ may be 1.

The client 104 may request visualization of entries in the data object X for analysis of trends or patterns that depend on the features of the entries. In one embodiment, the privacy system 160 generates a differentially private visualization of the requested data entries from X. FIG. 4 illustrates displaying results of a differentially private count query to the user interface of the client, according to one embodiment.

The privacy system 160 first maps the requested entries from X for the selected features specified by the client 104. For example, as shown in the visualization 410 of FIG. 4, a series of requested entries are plotted depending on their values for Feature 1 and Feature 2. The privacy system 160 then generates disjoint regions on the plot and retrieves the counts of entries in each of the disjoint regions. In visualization 410, the privacy system 160 divides the plot into disjoint squares and retrieves the count of entries in each square.

For each disjoint region, the privacy system 160 submits a differentially private count query to the count engine 302, and randomly plots a number of entries determined by the DP response 112 of the count engine 302 for that region. The resulting DP visualization plot is returned to the client 104 for display to a user by the user interface 150. For example, square 440 in visualization 410 contains 3 entries, while the same square in DP visualization 420 contains 4 randomly plotted entries determined by the DP response 112 of the count engine 302.

Median Engine 304

The median engine 304 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for generating the median of entries in a column of the data object X that satisfy a condition specified by the client 104, given privacy parameters (ε,δ). An example query command for accessing the median engine 304 is given in QC2 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for the median age of all patients in X.

The median engine 304 aggregates the values of entries satisfying the condition specified by the client 104 into a list U, and retrieves the median q from U. If privacy parameter δ is equal to zero, the median engine 304 returns

$y \approx {q + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \epsilon}} \right)} \cdot \frac{C(1)}{\epsilon}}}$

as the DP response 112 for display on the user interface 150, in which c₁, c₂ are constant factors. Example values for c₁,c₂ may be 6 and ⅙, respectively. If δ is non-zero, the median engine 304 returns

$y \approx {q + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \frac{\epsilon}{{2 \cdot \log}\frac{1}{\delta}}}} \right)} \cdot \frac{L(1)}{\epsilon}}}$

as the DP response 112 for display on the user interface 150. Example values for c₁,c₂ may be 2 and 1, respectively.

Mean Engine 306

The mean engine 306 produces a DP response 112 responsive the differentially private security system 102 receiving a query 108 for generating the mean of entries in a column of the data object X that satisfy a condition specified by the client 104, given privacy parameters (ε,δ). An example query command for accessing the mean engine 306 is given in QC3 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating the mean age of patients that are above the age of 30.

The mean engine 306 aggregates the values of entries satisfying the condition specified by the client 104 into a list U. Assuming there are n values in U, the mean engine 306 further divides U into m sub-lists V_(j=1, 2, . . . , m) each with n/m values. The mean engine 306 aggregates each mean r_(j) of sub-list V_(j) into a list R. The mean engine 306 requests a differentially private median query of the values in R to the median engine 304. The resulting output from the median engine 304 is returned as the DP response 112 for display on the user interface 150.

Variance Engine 308

The variance engine 308 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for generating the variance of entries in a column of the data object X that satisfy a condition specified by the client 104, given privacy parameters (ε,δ). An example query command for accessing the variance engine 308 is given in QC4 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating the variance of the age of all patients in X.

The variance engine 308 aggregates the values of entries satisfying the condition specified by the client 104 into a list U. Assuming there are n values in U, the variance engine 308 further divides U into m sub-lists V_(j=1, 2, . . . , m) each with n/m values. The variance engine 308 aggregates each variance r_(j) of sub-list V_(j) into a list R. The variance engine 308 requests a differentially private median query of the values in R to the median engine 304. The resulting output from the median engine 304 is returned as the DP response 112 for display on the user interface 150.

IQR Engine 310

The IQR engine 310 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for generating the interquartile range (IQR) of entries in a column of the data object X that satisfy a condition specified by the client 104, given privacy parameters (ε,δ). An example query command for accessing the IQR engine 310 is given in QC5 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating the IQR of the age of all patients in X.

In one embodiment, the IQR engine 310 aggregates the values of entries satisfying the condition specified by the client 104 into a list U. Assuming there are n values in U, the sample IQR of U is denoted as IQR(U), and a log transform of IQR(U) is denoted as:

${H_{n}(U)} = {\log_{1 + \frac{1}{logn}}{{{IQR}(U)}.}}$

The IQR engine 310 further maps the quantity H_(n)(U) to an integer k₀ such that H_(n)(U)ϵ[k₀, k₀+1). The IQR engine 310 extracts a value A₀(U) indicating the number of entries in U required to change in order for the new list Ũ to satisfy H_(n)(Ũ)∉[k₀,k₀+1).

The IQR engine 310 then generates a value R₀(U) given by:

${R_{0}(U)} \approx {{A_{0}(U)} + {L\left( \frac{C_{1}}{\epsilon \;} \right)}}$

in which c₁ is a constant factor. If R₀(U) is greater than a predetermined threshold, the IQR engine 310 returns

${y = {{{IQR}(U)} \cdot \left( \frac{1}{1 + {\log \; n}} \right)^{L{(\frac{c - 1}{\epsilon})}}}},$

as the DP response 112 for display on the user interface 150. If R₀(U) is equal to or less than the predetermined threshold, the IQR engine 310 returns “No Answer” as the DP response 112 for display on the user interface 150.

In another embodiment, the IQR engine 310 aggregates the values of entries satisfying the condition specified by the client 104 into an ordered list U. The IQR engine 310 retrieves the first quartile and the third quartile from U, given by q and q′, respectively. If δ is zero, the IQR engine 310 returns:

$y \approx {\left( {q + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \epsilon}} \right)} \cdot \frac{c(1)}{\frac{\epsilon}{2}}}} \right) - \left( {q^{\prime} + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \epsilon}} \right)} \cdot \frac{c(1)}{\epsilon/2}}} \right)}$

as the DP response 112 for display on the user interface 150, in which c₁, c₂ are constant factors.

If δ is non-zero, the IQR engine 310 returns:

$y \approx {\left( {q + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \frac{\epsilon}{{2 \cdot \log}\; \frac{1}{\delta}}}} \right)} \cdot \frac{L(1)}{\epsilon/2}}} \right) - \left( {q^{\prime} + {c_{1} \cdot {S_{M}\left( {U;{c_{2} \cdot \frac{\epsilon}{{2 \cdot \log}\; \frac{1}{\delta \;}}}} \right)} \cdot \frac{L(1)}{\epsilon/2}}} \right)}$

as the DP response 112 for display on the user interface 150, in which c₁, c₂ are constant factors.

Batch Gradient Engine 312

The batch gradient engine 312 produces a DP response 112 responsive to the differentially private security system 102 receiving a valid query 108 for generating a set of parameters θ for a general linear model that captures the correlation between a series of observable features and a dependent feature, given privacy parameters (ε,δ). The general linear model is trained on the selected columns of X. An example query command for accessing the batch gradient engine 312 is given in QC6 above.

Given a row vector x that contains a series of observable features and a label feature y, the correlation between the observable features and the label feature in a general linear model may be given as:

y=xθ ^(T),

where θ is a row vector containing parameters of the model. That is, the label feature is modeled as a weighted sum of the observable features, where each value in θ is the weight given to a corresponding observable feature.

For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating a set of parameters θ for a general linear model that captures the correlation between the height of the patients (observable feature) and the age of the patients (label feature). As another example, the features may be categorical in nature, and the requested parameters θ may be for a general linear model that captures the correlation between the height, age, residence of the patients (observable features) and whether the patient will or has contracted a disease (label feature).

Examples of general linear models supported by the batch gradient engine 312 are, but not limited to, linear regression, logistic regression, and support vector machine (SVM) classifiers.

The optimal values for the set of parameters θ is found by training the general linear model on training data (Xtrain, ytrain) consisting of selected columns of data object X. Specifically, X_(train) is a matrix database in which each column corresponds to a selected observable feature, and y is a column vector of the selected label feature values. Each entry in X_(train) has a one-to-one correspondence with an entry in y. The optimal θ is generally found by minimizing a loss function on (X_(train), y_(train)) over possible values of θ. Mathematically, the minimization is given by:

$\theta = {\underset{\theta}{\arg \; \min}\mspace{11mu} {{l\left( {X_{train},{y_{train};\theta}} \right)}.}}$

The batch gradient engine 312 returns a DP response 112 θ_(DP) of a differentially private batch gradient query by perturbing the loss function to be minimized. Specifically, the perturbed minimization is given by:

${\theta_{DP} = {{\underset{\theta}{\arg \; \min}\mspace{11mu} {l\left( {X_{train},{y_{train};\theta}} \right)}} + {\theta^{T}{v\left( {G\left( \frac{{4 \cdot K^{2} \cdot R}{\frac{2}{2} \cdot \left( {{\log \; \frac{1}{\delta}} + \epsilon} \right)}}{\epsilon^{2}} \right)} \right)}}}},$

in which K is the Lipschitz constant for loss function l(⋅). If j is the index of the columns in X_(train), x/ denotes the value of entry i and column j in X_(train), and it is publicly known that for each column j, a^(i)≤x_(i) ^(j)≤b^(i), R₂ may be given by:

R ₂=max(∥u∥ ₂ |a ^(j) ≤u ^(j) ≤b ^(j))

where u is a vector having elements u^(j). The DP response 112 θ_(DP) may be provided for display on the user interface 150.

Stochastic Gradient Engine 314

Similarly to the batch gradient engine 312, the stochastic gradient engine 314 produces a DP response 112 responsive to the differentially private security system 102 receiving a valid query 108 for generating a set of parameters θ for a general linear model that captures the correlation between a series of observable features and a label feature, given privacy parameters (ε,δ). An example query command for accessing the stochastic gradient engine 314 is given in QC7 above.

Similar to the batch gradient engine 312, examples of general linear models supported by the stochastic gradient engine 314 are, but not limited to, linear regression, logistic regression, and support vector machine (SVM) classifiers.

The stochastic gradient engine 314 also minimizes a loss function on training data (X_(train), y_(train)) over possible values of θ to find the optimal vales of parameter vector θ. However, the stochastic gradient engine 314 may minimize the loss function based on individual points or a subset of the training data, instead of the entire training data.

As discussed in reference to the batch gradient engine 312, a general minimization problem for finding the optimal values for θ over training data (X_(train), y_(train)) is given by:

$\theta = {\underset{\theta}{\arg \; \min}\mspace{11mu} {l\left( {X_{train},{y_{train};\theta}} \right)}}$

where l(⋅) is a loss function. The minimization is solved by applying stochastic gradient descent on the loss function l(⋅) with respect to θ. This involves the steps of identifying an initial set of values for θ, calculating the gradient of the loss function with respect to θ, and updating θ based on the calculated gradient. The steps are repeated until the algorithm reaches convergence, and an optimal set of values for θ that minimize the loss function are identified.

Specifically, given the estimate for the parameter θ_(t) at time t, stochastic gradient descent generates a new estimate θ_(t+1) at the next time step t+1 by the following equation:

θ_(t+1)=θ_(t)−η_(t) ·n·∇ _(θ) _(t) l(X _(train) ,y _(train);θ),

in which ∇_(θ) _(t) l(X_(train), y_(train); θ) is the gradient of the loss function with respect to θ, and η_(t) is the learning rate. The algorithm is repeated until the estimate for θ converges.

The stochastic gradient engine 314 returns a DP response 112 θ_(DP) of a differentially private stochastic gradient query by perturbing the update of θ at one or more time steps of the stochastic gradient descent algorithm. Specifically, a perturbed update at time t to t+1 is given by:

${\theta_{t + 1} = {\theta_{t} - {\eta_{t} \cdot n \cdot {\nabla_{\theta_{t}}{l\left( {X_{train},{y_{train};\theta}} \right)}}} - {\eta_{t} \cdot {v\left( {G\left( \frac{c_{1}^{2} \cdot n^{2} \cdot \left( {\log {\frac{n}{\delta} \cdot \log}\frac{1}{\delta}} \right)}{\epsilon^{4}} \right)} \right)}}}},\mspace{20mu} {{where}\mspace{14mu} \eta_{t}\mspace{14mu} {is}\mspace{14mu} {the}\mspace{14mu} {learning}\mspace{14mu} {{rate}.}}$

The stochastic gradient engine 314 may output the perturbed update at each time step as the DP response 112 for display on the user interface 150, or the converged parameter vector θ_(DP) as the DP response 112 for display on the user interface 150.

Random Forest Engine 316

The random forest engine 316 produces a DP response 112 responsive to the differentially private security system 102 receiving a valid query 108 for generating a trained random forest classifier that bins a series of feature values into one among multiple categories, given privacy parameters (ε,δ). The random forest classifier is trained on the selected columns of X. An example query command for accessing the random forest engine 316 is given in QC8 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating a trained random forest classifier that receives values for the height and age of a patient and determines whether the patient has contracted the disease or not.

The random forest classifier, is trained on training data (X_(train), y_(train)) to learn the correlation between the selected features of an entry and the category the entry belongs to. Specifically, X_(train) is a matrix database in which each column corresponds to a selected feature of interest to the client 104, and y is a column vector of already known labels indicating the category of a corresponding entry. Each entry in X_(train) has a one-to-one correspondence with a label entry in y. Upon being trained, the random forest classifier, or a classifier in general, receives a new data entry with selected feature values and generates an estimate of the category for the new entry.

The random forest classifier is an ensemble of individual binary decision tree classifiers, in which each binary decision tree generates an estimate for the category of an entry. Given a new data entry, the random forest classifier aggregates the category estimates from each binary decision tree and produces a final estimate for the category of the data entry.

FIG. 5 is an example diagram of a trained binary decision tree, according to one embodiment. Each decision tree includes a hierarchical structure with a plurality of T nodes ti=1, 2, . . . , T and a plurality of directed edges between a parent node and a child node. A parent node is a node that has outgoing edges to a child node, and a child node is a node that receives edges from a parent node. In the particular embodiment of a binary decision tree, each parent node has two child nodes. The nodes are one among a root node, in which the node has no incoming edges, an internal node, in which the node has one incoming edge with two outgoing edges, and a leaf node, in which the node has one incoming edge with no outgoing edges. For example, the example decision tree in FIG. 5 has seven nodes t1, t2, t7 and six edges. t1 is the root node, t2 and t3 are internal nodes, and t4-t7 are leaf nodes.

For each trained binary decision tree, each node except the root node corresponds to a partition of training data entries formed by a splits at a parent node. The splits at the parent node is based on a test condition of a feature of the training data (X_(train), y_(train)) that compares the feature value of an entry to a reference value, and verifies whether the feature value meets that condition or not. Returning to the example shown in FIG. 5, node t₁ creates a split s₁ into two child nodes t₂ and t₃ based on the test condition x₅≥5, which checks if an entry contains a fifth feature value equal to or greater than 5. The training data (X_(train), y_(train)) is thus split at s₁ into one partition that contains entries with x₅≥5, and another partition that contains entries with x₅<5. The former partition is directed to child node ti and the latter partition is directed to child node t₂. The partitioning process is repeated until the leaf nodes of the binary decision tree are determined.

At the end of the training process, each leaf node is associated with a category that has a dominant proportion in the corresponding partition at the leaf node. In FIG. 5, leaf node t4 is assigned label “1,” since the proportion of “1” labels in leaf node t4, denoted by p(1|t4), is greater than the proportion of “0” labels in leaf node t4, denoted by p(0|t4). Given a new data entry with an unknown category, the trained decision tree generates a label estimate by checking the appropriate feature values of the data entry at each node as it propagates through the tree to a destination leaf node. Upon arriving at the leaf node, the data entry is assigned the category label associated with the leaf node.

The random forest engine 316 returns a DP response 112 of a differentially private random forest query by perturbing the proportion of training data entries at leaf nodes of each trained binary decision tree. Specifically, the random forest engine 316 trains a random forest classifier T with an ensemble of N_(trees) binary decision trees B_(j=1, 2, . . . , N) _(trees) using training data (X_(train), y_(train)) from the data object X. Assuming a binary classification problem with two labels “0” and “1,” the random forest engine 316 perturbs the proportion of data entries associated with each category for each leaf node L. The perturbed proportion p_(DP)(⋅|T_(L)) is given by:

${{p_{DP}\left( {0t_{L}} \right)} \approx {{p\left( {0t_{L}} \right)} + {L\left( \frac{\epsilon}{\log \; N_{trees}} \right)}}},{{p_{DP}\left( {1t_{L}} \right)} \approx {{p\left( {1t_{L}} \right)} + {{L\left( \frac{\epsilon}{\log \; N_{trees}} \right)}.}}}$

The random forest engine 316 returns the random forest classifier TDP containing an ensemble of perturbed binary decision trees BDPj=1, 2, . . . , Ntrees as the DP response 112. Moreover, the random forest engine 316 may display the perturbed proportion of data entries for leaf nodes of each binary decision tree BDPj=1, 2, . . . , Ntrees for display on the user interface 150.

Histogram Engine 318

The histogram engine 318 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for generating a histogram of a selected column in X, given privacy parameters (ε,δ). The histogram engine 318 creates one or more bins corresponding to one or more disjoint ranges of the selected feature values, and indicates the number or proportion of entries that belong to each bin. An example query command for accessing the histogram engine 318 is given in QC9 above. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating a histogram of the age of all patients for bins age 0-10, 11-20, 21-30, and so on.

The histogram engine 318 returns a DP response 112 of a differentially private histogram query by perturbing the counts for each bin.

In one embodiment, the histogram engine 318 generates the requested histogram from the selected column of X, and perturbs the counts of each bin by submitting a request to the count engine 302. FIG. 6 illustrates perturbing the counts for a differentially private histogram query, according to one embodiment. As shown in FIG. 6, the histogram engine 318 generates histogram 600 by counting the number of entries corresponding to each bin b_(i=1, 2, . . . , B). The histogram engine 318 then requests the count engine 302 to perturb the counts qi for each bin to generate a perturbed histogram 602. As shown in FIG. 6, the count 608 for bin b5 in the perturbed histogram 602 is a perturbed version of count 604 in the original histogram 600.

In another embodiment, the histogram engine 318 generates the requested histogram from the selected column of X, and perturbs the counts of each bin by decomposing the counts using a private wavelet decomposition algorithm. In such an embodiment, the histogram engine 318 aggregates the counts q_(i=1, 2, . . . , B) for each bin b_(i=1, 2, . . . , B) into a matrix (or vector) Q. The histogram engine 318 decomposes Q into a tree structure that is representative of a wavelet decomposition. Each leaf node of the tree corresponds to a count q_(i), and each parent node of the tree corresponds to one of multiple wavelet coefficients c_(j=1, 2, . . . , m). The value of a wavelet coefficient c_(j) is calculated based on the counts q_(i) incorporated in the leaf nodes of the tree. This allows a count q_(i) to be reconstructed as a function ƒ_(i) of the wavelet coefficients C_(j=1, 2, . . . , m). That is, for each count q_(i):

q _(i)=ƒ_(i)(c ₀ ,c ₁ , . . . ,c _(m)).

The histogram engine 318 generates a perturbed histogram by perturbing the wavelet coefficients, and reconstructing the counts using the perturbed wavelet coefficients. Specifically, the perturbed wavelet coefficients C^(DP) _(i=1, 2, . . . , m) are given by:

$c_{i}^{DP} = {c_{i} + {{L\left( \frac{2^{l + 1}}{\epsilon \cdot m} \right)}.}}$

The reconstructed counts from the perturbed wavelet coefficients is now given by:

q _(i) ^(DP)=ƒ_(i)(c ₀ ^(DP) ,c ₁ ^(DP) , . . . ,c _(m) ^(DP)).

The histogram engine 318 outputs the perturbed histogram as the DP response 112 for display on the user interface 150.

In one embodiment, the histogram engine 318 may also be used to generate a differentially private visualization of data entries as described above in reference to the count engine 302 and FIG. 4. For example, the histogram module 318 may construct a multi-dimensional histogram corresponding to counts of the requested data entries in each region, perturb the histogram using mechanisms described above (e.g., private wavelet decomposition algorithm), and display the differentially private plot of the requested data entries on the user interface 150.

Model Testing Engine 320

The model testing engine 320 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for testing the performance of a classification model, given privacy parameters (ε,δ). The classification model is trained and tested on selected columns of X. As such, the model testing engine 320 may be appended to any other module that trains a classifier on X, such as the batch gradient engine 312, the stochastic gradient engine 314, or the random forest engine 316. For the example data object X shown in FIG. 2, the client 104 may submit a query 108 to return a DP response 112 for generating a performance evaluation of a support vector machine classifier that was trained using the stochastic gradient engine 314.

As discussed in reference to the random forest engine 316, classification models in general is trained on training data (X_(train), y_(train)) to learn the correlation between selected features of an entry and the category the entry belongs to. The training data (X_(train), y_(train)) may be extracted from a subset of entries contained in the data object X. Upon being trained, the classifier is able to receive a new data entry containing values for the selected features and generate an estimate of the category for the new entry.

Often times, the estimate of the category for an entry is determined by applying a cutoff threshold to a numerical, not categorical, output of a classifier. For example, in the random forest classifier described in reference to the random forest engine 316, the category associated with a leaf node t_(L) is determined by the proportion of training data entries associated with each category, which is a numerical value. The random forest engine 316 may determine that a leaf node is associated with category “0” if the proportion of entries associated with label “0” is above a cutoff threshold of 0.5, 0.6, or 0.7. As another example, logistic regression classifiers output a numerical value in the range of [0, 1] given an entry of feature values. The entry may be classified into category “0” if the associated output is below a cutoff threshold of 0.5, 0.4, or 0.3. Regardless of the example, the cutoff threshold for determining the boundary between each category is a critical parameter depending on the context the classifier is applied to.

The model testing engine 320 receives a trained classifier and tests the performance of the trained classifier a series of cutoff thresholds, and generates a confusion matrix for each threshold indicating the performance of the classifier. The model testing engine 320 may test the performance of the classifier on testing data (X_(test), y_(test)). Similarly to training data, X_(test) contains a set of entries with selected feature values, and y_(test) contains a vector of already known labels for each corresponding entry in X_(test). However, in contrast to training data, testing data (X_(test), y_(test)) comprises entries that are not present in training data (X_(train), y_(train)). That is, testing data comprises entries that the classifier has not “seen” yet.

The model testing engine 320 generates a series of cutoff thresholds based on the numerical values of p. FIG. 7A illustrates a recursive process for identifying threshold points of the classification output vector for the model testing engine 320, according to one embodiment. As shown in FIG. 7A, sample values of p are plotted on a range of 0 to 1. A series of k cutoff thresholds, or a series of intervals, are recursively identified by the median engine 304 such that the number of elements of p in each interval is approximately equal. Specifically, the median engine 304 recursively identifies the perturbed median for an interval and subsequently, its corresponding sub-intervals generated by dividing the interval by the identified perturbed median, until k thresholds are identified.

For example, as shown in FIG. 7, the median engine 304 identifies m1 as the perturbed median for the first interval [0, 1]. Subsequently, the median engine 304 identifies m2 as the perturbed median for the resulting sub-interval [0, m1], and m5 as the perturbed median for the sub-interval [m1, 1]. This process is repeated for sub-intervals [0, m2], [m2, m1], [m1, m5], [m5, 1] and for its sub-intervals until k thresholds, mi=1, 2, . . . , k are identified.

For each threshold m_(i), the model testing engine 320 generates corresponding category label estimates from p, and compares the estimates to the vector of known labels y_(test). Given the comparisons, the model testing engine 320, constructs a confusion matrix that evaluates the performance of the classifier.

FIG. 7B illustrates an example confusion matrix 700 generated by the model testing engine 320, according to one embodiment. As shown in FIG. 7B, the confusion matrix 700 contains the number of testing data entries for 4 categories: i) entries that have an actual category of “1” and an estimate category of “1” (“True Positive” entries), ii) entries that have an actual category of “0” and an estimate category of “0” (“True Negative” entries), iii) entries that have an actual category of “0” and an estimate category of “1” (“False Positive” entries), and iv) entries that have an actual category of “1” and an estimate category of “0” (“False Negative” entries). For a given threshold, a data entry only contributes to one among the 4 categories.

For each threshold m_(i), the model testing engine 320 generates a perturbed confusion matrix by using the histogram engine 318. This is because each entry contributes to only one among the 4 disjoint categories, and thus, the entries in the confusion matrix 700 can be viewed as a histogram. The model testing engine 320 outputs each threshold m_(i), and the corresponding perturbed confusion matrix as the DP response 112 for display on the user interface 150.

Synthetic Database Engine 322

The synthetic database engine 322 produces a DP response 112 responsive to the differentially private security system 102 receiving a query 108 for transforming X into a synthetic database S, given privacy parameters (ε,δ). The resulting synthetic database S has a number of entries corresponding to that in X, but a fewer number of columns or features than X. Moreover, the spatial relationship between a pair of entries in X is retained in S. The transformation of X to S is (ε,δ)-differentially private with respect to a neighboring data object X′ with a 1-element difference from X.

The synthetic database engine 322 produces a DP response 112 of a differentially private synthetic database query by projecting the elements of X to S using a projection matrix. Assuming that data object X is a n×p matrix having n rows and p columns, the transformation by the synthetic database engine 322 is given by:

$S = {X*{J\left( {G\left( \frac{{4 \cdot \log}\; \delta}{n^{2} \cdot \epsilon^{2}} \right)} \right)}}$

where J is a p×k projection matrix, with k<p. The resulting synthetic database matrix S is a n×k matrix containing equal number of entries or rows as data object matrix X, but containing a smaller number of features or columns than the original data object X.

As discussed above, the transformation using projection matrix J is (ε,δ)-differentially private. Moreover, the spatial relationship between a pair of entries in X is retained in S. That is, the distance between a pair of entries (xi,xj) in the p-dimensional feature space of X is approximately equal to the distance between a pair of entries (si,sj) in the k-dimensional feature space of S. The synthetic database engine 322 outputs S as the DP response 112 for display on the user interface 150.

FIG. 8 is a modification 800 of the system 100 in FIG. 1 that allows the client 104 access to synthetic database 806 generated by the synthetic database engine 322, according to one embodiment. As shown in FIG. 8, the modified system 800 may allow the client 104 to access the synthetic database 806 generated by the synthetic database engine 322 through the differentially private security system 102. Since the transformation from X to S is (ε,δ)-differentially private, the privacy of X is retained.

FIG. 9 illustrates applying a clustering query to entries of the synthetic database, according to one embodiment. The various modules of the privacy system 160 and other analytical modules may be applied to the synthetic database 806 instead of the data object X to extract patterns or trends related to the information in X. The results of the analysis on the synthetic database 806 may also be provided for display on the user interface 150. For example, the client 104 may submit a clustering query on the entries of the synthetic database 806 using the batch gradient engine 312 or the stochastic gradient engine 314.

In the example of FIG. 9, clusters 902 and 904 are results of a non-differentially private clustering query on a data object X having two columns or features. Each cluster 902 and 904 are associated with a group of entries. Since the clustering query is not differentially private on X, the results of the query are not shown to the client 104. Clusters 906 and 908 are results of a non-differentially private clustering query on the synthetic database S having one column or feature due to the transformation by the synthetic database engine 322. Since the transformation preserves the spatial relationship between a pair of entries, cluster 906 is largely associated with the same entries in cluster 902, and cluster 908 is largely associated with the same entries in cluster 904. Since the synthetic database S is (ε,δ)-differentially private, the results of the clustering query may be displayed to the client 104 using the user interface 150.

Validation Engine 324

The validation engine 324 produces a DP response 112 responsive to the differentially private security system 102 receiving a request for whether a query 108 satisfies the definition of (ε,δ)-differential privacy for privacy parameters (ε,δ). In one embodiment, the validation engine 324 may receive a function call from the client 104 that points to the query 108. The query 108 may be, for example, an analytical model or an algorithm that can be applied to a data object X.

The validation engine 324 certifies whether the received query 108 satisfies the definition of (ε,δ)-differential privacy by applying the query 108 to example pairs of neighboring data objects (Z, Z′). Specifically, the validation engine 324 generates pairs of neighboring data objects (Z, Z′), having at most 1 entry different from each other. The validation engine 324 applies the received query 108 to each example pair of neighboring data objects (Z, Z′) and determines whether an estimate of the quantity Pr[M(X)ϵS]/Pr[M(X′)ϵS] satisfies the definition of (ε,δ)-differential privacy a sampling of outputs from S of the query M and over the randomness of the query M.

In one embodiment, the validation engine 324 may output a binary value to the client 104 as the DP response 112 for display on the user interface 150 that indicates whether or not the query 108 is (ε,δ)-differentially private. In some embodiments, the validation engine 324, in response to a determination that the query 108 is not (ε,δ)-differentially private, can reject or deny the query.

FIG. 10 illustrates a process for responding to a database query by executing a differentially private version of the query on the database, according to one embodiment.

A request from a client device to perform a query is received 1010 and a level of differential privacy corresponding to the request is identified. A set of data in the private database system and a set of operations to be performed based on the received request is identified 1012. The set of identified data in the private database system is accessed 1014. The set of operations is modified 1016 based on the received level of differential privacy. The set of modified operations is performed 1018 on the set of data to produce a differentially private result set. The differentially private result set is provided 1020 to the client device for display on the client device.

FIG. 11 is a block diagram illustrating components of an example machine able to read instructions from a machine-readable medium and execute them in a processor (or controller). Specifically, FIG. 11 shows a diagrammatic representation of a machine in the example form of a computer system 1100. The computer system 1100 can be used to execute instructions 1124 (e.g., program code or software) for causing the machine to perform any one or more of the methodologies (or processes) described herein. In alternative embodiments, the machine operates as a standalone device or a connected (e.g., networked) device that connects to other machines. In a networked deployment, the machine may operate in the capacity of a server machine or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment.

The machine may be a server computer, a client computer, a personal computer (PC), a tablet PC, a set-top box (STB), a smartphone, an internet of things (IoT) appliance, a network router, switch or bridge, or any machine capable of executing instructions 1124 (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute instructions 1124 to perform any one or more of the methodologies discussed herein.

The example computer system 1100 includes one or more processing units (generally processor 1102). The processor 1102 is, for example, a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processor (DSP), a controller, a state machine, one or more application specific integrated circuits (ASICs), one or more radio-frequency integrated circuits (RFICs), or any combination of these. The computer system 1100 also includes a main memory 1104. The computer system may include a storage unit 1116. The processor 1102, memory 1104 and the storage unit 1116 communicate via a bus 1108.

In addition, the computer system 1106 can include a static memory 1106, a display driver 1110 (e.g., to drive a plasma display panel (PDP), a liquid crystal display (LCD), or a projector). The computer system 1100 may also include alphanumeric input device 1112 (e.g., a keyboard), a cursor control device 1114 (e.g., a mouse, a trackball, a joystick, a motion sensor, or other pointing instrument), a signal generation device 1118 (e.g., a speaker), and a network interface device 1120, which also are configured to communicate via the bus 1108.

The storage unit 1116 includes a machine-readable medium 1122 on which is stored instructions 1124 (e.g., software) embodying any one or more of the methodologies or functions described herein. The instructions 1124 may also reside, completely or at least partially, within the main memory 1104 or within the processor 1102 (e.g., within a processor's cache memory) during execution thereof by the computer system 1100, the main memory 1104 and the processor 1102 also constituting machine-readable media. The instructions 1124 may be transmitted or received over a network 1126 via the network interface device 1120.

While machine-readable medium 1122 is shown in an example embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, or associated caches and servers) able to store the instructions 1124. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing instructions 1124 for execution by the machine and that cause the machine to perform any one or more of the methodologies disclosed herein. The term “machine-readable medium” includes, but not be limited to, data repositories in the form of solid-state memories, optical media, and magnetic media.

Budget Tracking

Returning to FIG. 1, the client 104 is associated with a privacy budget that limits access to data of the databases 106. The client 104 specifies a set of privacy parameters each time the client 104 submits a query 108, and the submitted query is associated with a privacy spend based on the set of privacy parameters. The privacy budget is representative of a limit to the number and/or type of queries 108 available to the client 104. For instance, the privacy budget can limit the privacy loss associated with queries to a differentially private database system 102. If the client 108 exceeds a corresponding privacy budget's maximum privacy spend with a query 108, a security action is performed. The security action can be selected based upon a corresponding security policy. Security actions and security policies are discussed in further detail with respect to FIG. 13.

As an example, for a budgeted privacy parameter ε, the client 104 is allowed more queries associated with lower c values than higher c values. For example, if the privacy budget has a maximum privacy spend ε=1, and each query corresponds with a privacy spend of ε=0.1, ten queries are allowed before a security action is performed. On the other hand, if each query is associated with a privacy spend of ε=0.2, only five queries are allowed. The impact of a query upon a budget can depend on factors in addition to the budgeted privacy parameters, such as multipliers that are applied to one or more of the privacy parameters of the query before determining if the query is allowable in view of the budget.

The differentially private security system 102 maintains both privacy budgets and cumulative privacy spends. A cumulative privacy spend is a measure of how much of a budget has been spent. For example, if the budgeted privacy parameter is ε, where there have been five queries with spend ε=0.1, the cumulative privacy spend is 0.5. In an embodiment, determining whether a query can be executed or if a security action will be performed involves determining whether the sum of the budgeted privacy parameter associated with the query and the cumulative privacy spend exceeds the maximum privacy spend. If the privacy spend associated with a query causes the maximum privacy spend to be exceeded, then a security action, such as blocking the query, is performed.

FIG. 12 illustrates interactions with a differentially private database system 102 associated with a plurality of privacy budgets, according to one embodiment. FIG. 12 includes a data table 1210 (for instance, included in the database 106) that includes three entries, each with four attributes. For example, a first entry corresponds to a man named Albert who is 68 years old, is an American citizen, and has heart disease. The table 1210 is associated with a table budget 1215. The table budget 1215 is a privacy budget that limits access to the data table 1210. Each time a query of the table 1210 is executed, the cumulative privacy spend of the table budget 1215 is incremented by the privacy spend of the query, such as an ε value. If the sum of the privacy spend associated with the query and the cumulative privacy spend exceeds the table budget 1215, a security action is performed (such as the blocking of the query, the performance of a limited query, the generation of a notification based on the query, etc.). The table budget 1215 and its cumulative privacy spend can be set, adjusted, and managed by an administrator of or entity associated with the data table 1210. For example, the administrator of the data table 1210 can reset the cumulative privacy spend, or raise the budget.

In an embodiment, the table budget 1215 limits access to the data table 1210 by entry. For example, the table budget 1215 can maintain a cumulative privacy spend for each entry. In such an embodiment, only cumulative privacy spends of queried entries are incremented. If the sum of the privacy spend associated with a query and the cumulative privacy spend of an entry exceeds the maximum privacy spend of the entry, the entry can be excluded from further queries, but a different entry of the same table may still be queried if the sum of the privacy spend associated with the query and the cumulative privacy spend associated with the different entry is not exceeded. It should be noted that different entries may have different maximum privacy spends.

In the embodiment of FIG. 12, there are three users 1220A, 1220B, and 1220C. For the sake of this example, each user 1220 queries the table 1210 using a client 104 and is associated with a respective privacy budget (e.g., budget 1225A, budget 1225B, budget 1225C). It should be noted that in addition to privacy budgets corresponding to particular users, privacy budgets can be associated with clients, devices, database query contexts, time or date ranges, and the like.

Users of a differentially private database system 102 can be members of groups or organizations, each corresponding to a different/supplemental privacy budget. In the embodiment of FIG. 12, users 1220A and 1220B are members of group 1230A and users 1220B and 1220C are members of group 1230B. Group 1230A is associated with a group budget 1235A and group 1230B is associated with a group budget 1235B. The cumulative privacy spend associated with a group budget 1235 increases after the performance of a query by a user within the group, for instance by an amount equal to the privacy spend corresponding to the query.

The cumulative privacy spend associated with a personal budget 1225 increases in response to a successful query 1240A by user 1220A with the data table 1210, for instance by an amount equal to the value of the privacy spend corresponding to the query. As noted above, if the sum of the privacy spend corresponding to the query 1240A by the user 1220A and the cumulative privacy spend associated with the user 1220A exceeds the privacy budget 1225A associated with the user, a security action can be taken.

The cumulative privacy spend associated with a group budget 1235 increases in response to a successful query of the data table 1210 by any of the users of the group 1230A. For instance, if the user 1220A queries the data table 1210, and the privacy spend associated with the query is X, then the cumulative privacy spend associated with the group 1230A is increased by X (as is the cumulative privacy spend associated with the user 1220A). In the event that a query of the data table 1210 associated with a privacy spend causes either 1) the sum of the cumulative privacy spend associated with the group 1230A and the privacy spend corresponding to the query to exceed the group budget 1235A or 2) the sum of the cumulative privacy spend associated with user 1220A and the privacy spend corresponding to the query to exceed the budget 1225A, a security action can be taken (for instance, the query can be blocked). In other words, just because a privacy budget associated with one of a user and a group is not exceeded by a query doesn't guarantee that the query will be processed. Further, if the user 1220A queries the data table 1210 until the group budget 1235A is exceeded, user 1220B (also a member of group 1230A) can be prevented from querying the data table 1210, even though user 1220B hasn't previously queried the data table 1210. It should be noted that the user 1220B, being a member of both the group 1230A and the group 1230B, can be prevented from querying the data table 1210 in response to either the group budget 1235A or the group budget 1235B being exceeded. It should also be noted that the user 1220B (or any other user) can also be prevented from querying the data table 1210 in response to the table budget 1215 being exceeded.

The type and number of budgets associated with the environment of FIG. 12 can vary by embodiment. For example, a first embodiment can include a table budget 1215 and group budgets 1235, but no personal budgets 1225. A second embodiment can include a table budget 1215 and personal budgets 1225 but no group budgets 1235, and a third budget can include a table budget 1215, personal budgets 1225, and group budgets 1235. In some embodiments, any combination of budgets can be implemented within an embodiment of the environment of FIG. 12, and the users can each be organized into 0, 1, or 2 or more groups.

The budgets within a differentially private security system 102 can be set by an administrator, an entity associated with the differentially private security system 102, or the like. For example, an administrator can set, increase, or decrease personal, group, and table budgets, can reset cumulative privacy spends associated with one of users, groups, tables, and the like, or can take any other suitable action to implement and maintain privacy budget tracking. In some embodiments, the administrator can remove a budget, allowing indefinite querying, and can lock budgets or data tables to prevent further access by a user or group. Furthermore, the administrator can create, modify, and implement security policies and security actions corresponding to the differentially private security system 102.

Budget tracking can prevent situations where multiple independent entities can collectively query a differentially private database, and can combine results to obtain more information about the underlying data within the database than would otherwise be permissible. For example, if a criminal tried to steal a person's health records using queries with high privacy loss to approximate with great specificity details of the person's health by coordinating with one or more other querying entities, an implementation of table-wide budget tracking as described herein may prevent the criminal from such coordination, thereby protecting the person's health data from being compromised.

FIG. 13 illustrates a process for tracking a privacy budget in a differentially private database system, according to one embodiment. The differentially private security system 102 receives 1310 a query request from a client device. The query request is a request to perform a query of the private database system 102 and is associated with a level of differential privacy, such as values for one or more privacy parameters, e.g. ε and δ, which are limited via one or more budgets within the differentially private security system 102.

The differentially private security system 102 accesses 1320 one or more privacy budgets relevant to the query. For example, if one or more tables are being queried, any table budgets of the one or more tables are accessed. Likewise, the personal budget of the client 104 requesting the query and/or the budget of the personal user account of the user instigating the query can be accessed. If the user requesting the query is a member of one or more groups, any group budgets of the one or more groups are accessed.

The differentially private security system 102 determines 1330 a privacy spend associated with the received request. This is based at least in part on the privacy parameters as set by the query. For example, if the c associated with a query is 0.1, the privacy spend can be determined based on the value ε=0.1. In such embodiments, the privacy spend can be 0.1, or can be some value computed based on 0.1. For each privacy budget associated with the query, the privacy spend is added to the cumulative privacy spend associated with each privacy budget to determine 1340 if the sum exceeds the privacy budget.

If the sums of the privacy spend and the cumulative privacy spends associated with each privacy budget corresponding to the query are each less 1350 than the maximum privacy spend allowed by the corresponding privacy budget, the query is performed and results are provided 1352 to the client. The cumulative privacy spend for each applicable privacy budget corresponding to the query is updated 1354 based on the determined privacy spend to reflect the loss of privacy due to the query. For example, if the cumulative privacy spend for a budget is 0.7 and a query is performed with a privacy spend of 0.1, the cumulative privacy spend is updated to 0.8.

If, for at least one privacy budget, the sum of the determined privacy spend and the cumulative privacy spend corresponding to the privacy budget is instead greater 1360 than the maximum privacy spend allowed by the budget, a security policy is accessed 1362 and a security action is performed 1634 based on the security policy. A security policy defines one or more security actions to be performed in response to the cumulative privacy spend associated with a query request exceeding a budget. For instance, a security action can include rejecting the query, providing a complete or partial set of query results to the client device while notifying the administrator or database manager that the query exceeded the maximum privacy spend, or any other suitable security action.

Security actions can be situational, and the security policy can set conditions under which different security actions are performed. For example, if the differentially private security system 102 is connected to a first database and a second database, the security actions performed in response to a privacy budget being exceeded may differ between the two. Security actions may depend on the extent to which a query exceeds a budget. For example, if a query exceeds a budget within a threshold amount, the query proceeds and an administrator is notified, but if the query exceeds the budget more than the threshold amount, the query is rejected. Security actions may be specific to users, clients, groups, tables, or any other suitable factor.

Relational Operators

Queries may include one or more relational operators, such as the projection operator, the selection operator, the union operator, or the join operator. Relational operators can modify metadata of the data being queried, which can affect the amount of noise added to query results to provide differential privacy. Relational operators may modify the sensitivity of the data being queried, which, depending upon the embodiment, can affect the privacy spend of the query. In an embodiment, queries are performed upon temporary copies of data to ensure the data and/or metadata of the database is not permanently modified by performing the queries. In an embodiment, the query syntax is Structured Query Language (SQL) or another programming language that enables querying a database.

The metadata described herein describes the data of one or more tables of a database. It may describe data of one or more tables overall, or may be specific to one or more columns, entries, features or categories of data. For example, a data table with two hundred entries, each associated with an age feature, has metadata indicating the minimum age found within the table is 2 years and the maximum age is 102 years. Queries that cause changes to database data can similarly cause changes to the metadata describing the changed database data. Continuing with the previous example, if the entry that includes “102 years” is updated to “103 years”, the metadata range is modified to a minimum of 2 years and a maximum of 103 years.

In some embodiments, a plurality of metadata types are maintained for the database, for instance pertaining to individual features, groups of features, one or more data tables overall, and/or the database as a whole. For example, a minimum and a maximum of a feature may be tracked, e.g. age or income, and an average of the feature may be tracked as well, such as an average age of 52 years. In another example, if a first feature is base salary and a second feature is yearly bonus, there could be metadata indicating an average total compensation based on base salary and yearly bonus.

Metadata pertaining to data being queried can impact the noise added when implementing differential privacy. For example, determining the noise added to a query response may be based on a minimum and a maximum of a feature of the data being queried. The range of the minimum and maximum, for example, could determine a multiplier by which to magnify or dampen added noise when making the results differentially private. In other words, the metadata associated with a query can affect the implementation of differential privacy to the query, for instance based on the sensitivity of the data being queried.

For example, a first query takes the mean of ten salaries ranging from $0 to $1,000,000, and a second query takes the mean of ten salaries ranging from $30,000 to $40,000. The first query is more sensitive because an individual entry can more dramatically impact the result of the query. For example, if all but one entries of the data queried by the first query include a $0 salary and one entry includes a $1,000,000 salary, the result of the query is very sensitive to the entry including a $1,000,000 salary. If this entry is removed, the actual result changes from $100,000 to $0. However, due to the increased density of salaries in the data queried by the second query, no one entry has as much impact upon the end result of the second query as the $1,000,000 entry has upon the first query. For example, if nine entries include a $30,000 salary and one includes a $40,000 salary, removal of the entry with $40,000 salary changes the actual result from $31,000 to $27,000, a much smaller change than $100,000 to $0. As such, the sensitivity of the second query is less than that of the first query.

A sensitivity factor k modifies the privacy spend of a query. The sensitivity factor is a measure of the extent to which an operation, such as a relational operation, can affect the privacy of the table, compounding the amount of information the query reveals, for instance as measured by ε. Relational operations in a query can magnify or reduce the sensitivity of the query, changing the sensitivity factor.

Determining the privacy spend of a query can include multiplying ε by the sensitivity factor k, i.e. ε *k. For example, if a relational operator doubles the sensitivity of a query, the privacy spend is 2ε, rather than just ε. Furthermore, the cumulative privacy spend increments by 2ε rather than ε. For example, if a cumulative privacy spend for ε is 0.3, a privacy parameter of a query is ε=0.2, and the sensitivity factor of the query is k=2, the cumulative privacy spend after the query is performed is 0.3+(0.2*2), or 0.7. The sensitivity factor impacts the noise added to the query to preserve differential privacy. For example, for the count engine 302, if the sensitivity factor is 2, the equation may instead become:

${y \approx {q + {L\left( {c_{1} \cdot \frac{2}{\epsilon}} \right)}}},$

In some embodiments, queried data is modified by one or more transformations in a relational operation within the query. Transformations that can augment a relational operator include arithmetic operators such as: addition, subtraction, multiplication, floating point and integer division, modulo, negation, sign, absolute value, power, exponential, square root, and logarithm; floor, ceiling, and rounding; logical operators including and, or, exclusive or, and not; comparators including equality, inequality, greater than, less than, greater than or equal, and less than or equal; trigonometric and hyperbolic functions like sine, cosine, tangent, arctangent, arcsine, arccosine, hyperbolic sine, hyperbolic cosine, hyperbolic tangent, hyperbolic arcsine, hyperbolic arccosine, and hyperbolic arctangent; minimum and maximum; decode; and coalesce. In some embodiments, only numerical queried features are transformed, and not categorical features.

Projection

FIG. 14 illustrates an example database projection relational operator, according to one embodiment. A projection operator is a relational operation where a subset of a data table is queried, the subset including data of one or more features stored in the table. For example, a subset of features are selected for one or more entries of the table. The projection operator may further include one or more transformations.

FIG. 14 includes a data table 1410 with four entries, each having four features (name, age, weight, and heart disease). Metadata 1415 of the table 1410 includes a minimum and a maximum value for the age feature, and a minimum and a maximum value for the weight feature. Age and weight are numerical features, whereas name and heart disease are categorical features. The table 1410 has a minimum age of 34 and a maximum age of 87, as well as a minimum weight of 156 pounds and a maximum weight of 328 pounds.

A query including a projection operator 1420 is performed upon the table 1410. In an embodiment, data relevant to the query is temporarily copied and the temporary copy is queried rather than the original database. In an embodiment, upon completion of the query, the temporary copy is erased. The query includes “SELECT Weight/2 FROM DataTable” which projects the weight feature from the data table 1410 in a temporary copy and performs an arithmetic division by two upon the projected weight of each entry in the temporary copy. After performing the division, each weight value in the database is halved. For example, the weight entry ‘328’ of the table 1410 is ‘164’ in the projected data 1430.

The arithmetic division changes the minimum and maximum values for the weight feature in the projected data 1430. The minimum value of the weight feature in the data table, 156 pounds, is halved, making the minimum value of the projected data 78 pounds. Likewise, the maximum value of the weight feature is halved from 328 pounds to 164 pounds. The metadata of the projection 1435 reflects the changes to the data accordingly, with the minimum changed to 78 and the maximum changed to 164. The altered metadata can impact the amount of noise added to the differentially private result of the query, for example, by changing a sensitivity factor k, as compared to an embodiment where the weight feature is not halved during the projection. For example, a query that performs a ‘mean’ operation on values of a specific feature may have a sensitivity of

$k = \frac{H - L}{N}$

where H is the maximum of the feature, L is the minimum of the feature, and N is the number of entries.

Selection

FIG. 15 illustrates an example database selection relational operator, according to one embodiment. A selection operator is a relational operation where a subset of a data table is queried, the subset including data of zero, one, or two or more entries stored in the table. For example, a subset of entries of a table are selected according to one or more conditions. The selection operation may further include one or more transformations.

FIG. 15 includes a data table 1510 with four entries, each having four features (name, age, weight, and heart disease). Metadata 1515 of the table 1510 includes a minimum and a maximum value for the age feature, and a minimum and a maximum value for the weight feature. Age and weight are numerical features, whereas name and heart disease are categorical features. The table 1510 has a minimum age of 34 and a maximum age of 87, as well as a minimum weight of 156 pounds and a maximum weight of 328 pounds.

A query including a selection operator 1520 is performed upon the table 1510. In an embodiment, data relevant to the query is temporarily copied and the temporary copy is queried rather than the original database. In an embodiment, upon completion of the query, the temporary copy is erased. The query includes “SELECT Weight FROM DataTable WHERE Weight>200” which projects the weight feature from the data table 1410 and selects entries with weight greater than two hundred pounds. Due to the selection operator, only two of the four entries are represented in the temporary copy of selected data from the data table 1530.

The selection changes the minimum and maximum values for the weight feature in the selected data from the data table 1530. Because of the condition applied to the weight feature by the selection operator 1520 (the selection only of weights greater than 200 pounds) the minimum weight of the selected data is 200 pounds. The metadata of the selection 1535 reflects the changes to the data accordingly, with the minimum set to 200. The maximum remains 328 because no condition was set by the query with regard to maximum weight. In an embodiment, the minimum weight is set not to the value of the condition, e.g. 200, but rather the actual minimum weight within the selected data (254 pounds in this example). In such an embodiment, the metadata records a minimum weight of 254 pounds rather than 200 pounds. The altered metadata can impact the amount of noise added to the differentially private result of the query, for example, by changing a sensitivity factor k.

Union

FIG. 16 illustrates an example database union relational operator, according to one embodiment. A union operation is a relational operation where data of two tables are combined. There are two types of union operators: set union operators and multiset union operators. For set union operations, only single copies of repeated entries are kept. For multiset union operations, each copy of an entry is kept, often resulting in repeated entries being kept. When a plurality of data tables are unioned as part of a query, the cumulative privacy spend of each data table is incremented by N*k*ε. k is the sensitivity of the query, including the sensitivity of any additional operations performed upon the unioned data, and N is a worst case multiplier indicating a worst case number of times an entry could exist among the data tables in the unioned data. If the union operator is a set union operator, or if the data tables being unioned share no entries, then N is 1. In an embodiment, the worst case number is the number of tables in the set union operation. For example, two data tables that share an entry are unioned in a multiset union, and a further operation with k=3 is performed upon the unioned data. Due to the overlapping entry and the union operator being a multiset union operator, the privacy spend of the query is 2*3*ε or 6ε. If the two data tables do not share any entries, the privacy spend may be 1*3*ε or 3ε.

FIG. 16 includes data tables 1610A and 1610B, each having four entries with four features (name, age, weight, and heart disease), and each having a corresponding worst case multiplier N, 1615A and 1615B, respectively. N=1 for each data table 1610 because each entry is unique within its respective table.

A query including a multiset union operator 1620 is performed upon the tables 1610. In an embodiment, data relevant to the query is temporarily copied and the temporary copy is queried rather than the original database. In an embodiment, upon completion of the query, the temporary copy is erased. The query includes “SELECT Name,Age FROM DataTableA UNION SELECT Name,Age FROM DataTableB” which projects the name and age features from each data table 1610 into unioned result data 1630. Because it is a multiset union operator, all names and ages are projected, regardless of whether or not an entry in one table 1610 has a copy in the other table 1610. For example, each data table 1610 has an entry for a man named John who is 56 years old, weighs 328 pounds, and has heart disease. The unioned data 1630 has two separate entries for John because he is in each table 1610 at the time the multiset union operation is performed. If the union operation were not a multiset union operation, only one entry of the two is kept in the unioned data 1630.

The unioned data 1630 has a worst case multiplier 1615C of N=2. It is 2 because of the overlapping entries between the two data tables 1610, for John and Jacob, which each appear twice in the unioned data 1630. The worst case multiplier 1615C increases the privacy spend of the query because further operations upon the unioned data 1630 has a higher risk of revealing information about the entries that are repeated.

For example, in a non-differentially private system, if a mean of the age feature of the unioned data 1630 is queried, the mean is skewed towards John and Jacob's ages because they each appear twice. The mean age of the unioned data 1630 is 53.75 years. If the union operation is a set union operation, and John and Jacob aren't repeated within the unioned data 1630, the mean age is 49.67 years. If a user performing the query 1620 knows John and Jacob are repeated in the multiset unioned data, it is possible for the user to infer from the mean of the ages of the multiset unioned data, as compared to the mean of the ages of the set unioned data that John and Jacob have an average age older than 49.67 years. If these queries are performed within a differentially private system with the same sensitivity applied to each, it may still be possible to determine how old John and Jacob are relative to the differentially-private average age. However, by doubling the sensitivity of the query with the multiset union operator via N, the mean of the multiset unioned data does not provide as much information and thereby prevents the user from definitively identifying John and Jacob as having an average age greater than that of the overall average age; the results are unreliable enough to not guarantee the accuracy of such a comparison.

Join

FIG. 17 illustrates an example database join operator, according to one embodiment. A join operation is a relational operator that produces a set of all combinations of entries of two data tables that are equal at one or more features (keys). If a first data table has M entries and a second data table has N entries, a worst case scenario join operation results in M*N entries identical at one or more features in the joined data. Using M*N as a sensitivity multiplier injects enough noise into the system that the differentially private result is often useless. Limiting the number of entries in each data table corresponding to each key limits the worst case scenario. If the first data table is limited to J entries corresponding to each key (a multiplicity of J) and the second data table is limited to K entries corresponding to each key (a multiplicity of K), the worst case possible has J*K entries identical at one or more features.

In an embodiment, J and K are provided by a user as part of a query. Alternatively, J and K can be determined by computing a desired rank statistic, namely, computing an upper bound on how many entries correspond to a particular key in a data table for some percentile of the data. For example, for 90% of the keys within a data table, there are a total of 30 or fewer entries per key. J and K could also be determined by computing the total number of distinct keys present in a table and dividing the total number of entries by the number of distinct keys.

The differentially private security system 102 pre-processes each data table involved in a join operation by limiting the first table to at most J entries corresponding to each key, and the second table to at most K entries corresponding to each key. After pre-processing, a query including a join operation proceeds as normal. Alternatively, instead of J and K, only one value, K, is provided or determined. In this embodiment, a join operation is performed, and the joined data is then limited to at most K instances of each key.

J and K are used as multipliers to the sensitivity of a query including a join operation. For example, when performing a count upon joined data, the operation's sensitivity is J*K instead of 1, and the privacy spend of the query is correspondingly J*K*ε. Alternatively, instead of multiplying by J*K for each table, the first table is given a privacy spend of J*ε and the second table is given a privacy spend of K*ε.

FIG. 17 includes data tables 1710A and 1710B, each having four entries with four features, and each having a corresponding limiting factor, 1715A and 1715B, respectively. Each limiting factor 1715 limits its corresponding table to at most 2 entries corresponding to each key present in the table when joined. Data table 1710A has features name, age, ID, and visit date. Data table 1710B has features name, weight, ID, and heart disease. A query including a join operation 1720 is performed upon the tables 1710. In an embodiment, data relevant to the query is temporarily copied and the temporary copy is queried rather than the original database. In an embodiment, upon completion of the query, the temporary copy is erased. The query includes “SELECT A.Age, B.Weight, A.VisitDate FROM A INNER JOIN FROM B ON A.ID==B.ID” which projects the name and visit date features from data table 1710A and the weight feature from data table 1710B into joined data 1730. The key in this join operation is ID.

The resulting joined data 1730 has four entries because each entry with ID “1” of data table 1710A is joined with each entry with ID “1” of data table 1710B. Neither table had its entries limited before the join operation because neither had more than 2 entries corresponding to any one key. The four entries in the joined data 1730 are all for a man named John who is 56 years old. Although certain data varies per entry, such as weight and visit date, John's data is still four times as sensitive than if there were just a single entry for him in the joined data 1730. This is reflected in the sensitivity multiplier for the table 1715C represented by L, which equals J*K, or 4. Additional operations upon the joined data therefore have a privacy spend multiplied by 4. For example, a count operation would have a privacy spend 4ε. This is because the repetition of data decreases privacy, similar to the union operation example described above.

Multiple Operators

Multiple relational operators may be executed as part of the same query. In such embodiments, the sensitivity for each operator is taken as a product to determine the total sensitivity for the query. Alternatively, privacy spend is determined on a per-table basis for each table involved in the query. For example, the query can include:

SELECT COUNT Age FROM ((A JOIN B USING A.ID=B.ID) UNION C)

involving three data tables A, B, and C which include features Age and ID.

In this example, a join operation is performed for A and B. Then a union operation is performed with C. The combined data is then projected at Age to determine a number of ages. The projection operation has a sensitivity multiplier of 1, and therefore does not magnify the privacy spend associated with the query. C is disjoint from A and B and so has a sensitivity multiplier of 1 and also does not magnify the privacy spend associated with the query. The cumulative privacy spend for C is therefore increased by ε. Continuing with this example, if A has multiplicity J=2 and B has multiplicity K=3, the cumulative privacy spend of A is increased by 2ε and the cumulative privacy spend of B is increased by 3ε, resulting in a total increase of 6ε. Accordingly, the cumulative privacy spend of the user instigating the query is increased 6ε, as the product of the sensitivity multipliers, 1*1*6, is 6.

OTHER CONSIDERATIONS

Some portions of the above description describe the embodiments in terms of algorithmic processes or operations. These algorithmic descriptions and representations are commonly used by those skilled in the data processing arts to convey the substance of their work effectively to others skilled in the art. These operations, while described functionally, computationally, or logically, are understood to be implemented by computer programs comprising instructions for execution by a processor or equivalent electrical circuits, microcode, or the like. Furthermore, it has also proven convenient at times, to refer to these arrangements of functional operations as modules, without loss of generality. The described operations and their associated modules may be embodied in software, firmware, hardware, or any combinations thereof.

As used herein any reference to “one embodiment” or “an embodiment” means that a particular element, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.

Some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. It should be understood that these terms are not intended as synonyms for each other. For example, some embodiments may be described using the term “connected” to indicate that two or more elements are in direct physical or electrical contact with each other. In another example, some embodiments may be described using the term “coupled” to indicate that two or more elements are in direct physical or electrical contact. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other. The embodiments are not limited in this context.

As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).

In addition, use of the “a” or “an” are employed to describe elements and components of the embodiments herein. This is done merely for convenience and to give a general sense of the disclosure. This description should be read to include one or at least one and the singular also includes the plural unless it is obvious that it is meant otherwise.

Upon reading this disclosure, those of skill in the art will appreciate still additional alternative structural and functional designs for a system and a process for receiving a query for a private database, and responding to the query by executing a differentially private version of the query on the private database. Thus, while particular embodiments and applications have been illustrated and described, it is to be understood that the described subject matter is not limited to the precise construction and components disclosed herein and that various modifications, changes and variations which will be apparent to those skilled in the art may be made in the arrangement, operation and details of the method and apparatus disclosed herein. 

1. A hardware database privacy device, the hardware database privacy device communicatively coupled to a private database system, and configured to: receive a request from a client device to perform a query of the private database system, the request associated with a level of differential privacy; access a privacy budget corresponding to the received request, the privacy budget including a cumulative privacy spend and a maximum privacy spend, the cumulative privacy spend representative of previous queries of the private database system; determine a privacy spend associated with the received request based at least in part on the level of differential privacy associated with the received request; in response to the sum of the cumulative privacy spend and the determined privacy spend being less than the maximum privacy spend: provide a set of results to the client device in response to the performed query; and update the cumulative privacy spend by incrementing the cumulative privacy spend by an amount equal to the determined privacy spend; and in response to the sum of the cumulative privacy spend and the determined privacy spend being equal to or greater than the maximum privacy spend: access a security policy associated with the privacy budget; and perform a security action based on the accessed security policy and the received request.
 2. The hardware database privacy device of claim 1, wherein the accessed privacy budget comprises a privacy budget for a user or a set of users corresponding to the received request.
 3. The hardware database privacy device of claim 1, wherein the accessed privacy budget comprises a privacy budget for a dataset being queried.
 4. The hardware database privacy device of claim 1, wherein the level of differential privacy comprises privacy parameters ε and δ, and wherein the determined privacy spend is computed based on one or more of: a dataset being queried, a query type, the privacy parameter ε, the privacy parameter δ, and a sensitivity factor associated with the query.
 5. The hardware database privacy device of claim 4, wherein the determined privacy spend comprises the product of the sensitivity factor and ε.
 6. The hardware database privacy device of claim 4, wherein the determined privacy spend comprises ε.
 7. The hardware database privacy device of claim 4, wherein the query comprises one of a ‘select’ relational operator and a ‘where’ relational operator, and wherein the determined privacy spend comprises ε.
 8. The hardware database privacy device of claim 7, wherein the relational operator modifies a bound of the dataset, and wherein ε is modified in response to modifying the bound of the dataset.
 9. The hardware database privacy device of claim 4, wherein the query comprises a ‘join’ relational operator for a plurality of datasets, and wherein the sensitivity factor is based on a number of times a most frequently-occurring entry occurs within a dataset of the plurality of datasets.
 10. The hardware database privacy device of claim 9, wherein the plurality of datasets comprises a first dataset and a second dataset, wherein the first dataset is associated with a first sensitivity factor, wherein the second dataset is associated with a second sensitivity factor, and wherein determining a privacy spend associated with the received request comprises determining a first privacy spend associated with the first dataset and determining a second privacy spend associated with the second dataset.
 11. The hardware database privacy device of claim 4, wherein the query comprises a ‘union’ relational operator for a first dataset and a second dataset, and wherein the sensitivity factor is based on an amount of overlap between the first dataset and the second dataset.
 12. The hardware database privacy device of claim 11, wherein the sensitivity factor is 1 if the first dataset and the second dataset have no overlap.
 13. The hardware database privacy device of claim 11, wherein the sensitivity factor is 2 if the first dataset and the second dataset are identical.
 14. The hardware database privacy device of claim 11, wherein c is modified based on a union of a bounds of the first dataset and a bounds of the second dataset.
 15. The hardware database privacy device of claim 1, wherein updating the cumulative privacy spend comprises updating a cumulative privacy spend for each dataset associated with the query.
 16. The hardware database privacy device of claim 1, wherein the query is associated with a plurality of datasets, and wherein each dataset is associated with a corresponding maximum privacy spend such that at least one dataset is associated with a different corresponding maximum privacy spend than another dataset.
 17. The hardware database privacy device of claim 1, wherein performing the security action comprises rejecting the query.
 18. The hardware database privacy device of claim 1, wherein performing the security action comprises providing the set of results to the client device and notifying a database manager that the query exceeded the maximum privacy spend.
 19. A non-transitory computer-readable storage medium storing executable instructions that, when executed by a processor, cause the processor to perform steps comprises: receiving a request from a client device to perform a query of a private database system, the request associated with a level of differential privacy; accessing a privacy budget corresponding to the received request, the privacy budget including a cumulative privacy spend and a maximum privacy spend, the cumulative privacy spend representative of previous queries of the private database system; determining a privacy spend associated with the received request based at least in part on the level of differential privacy associated with the received request; in response to the sum of the cumulative privacy spend and the determined privacy spend being less than the maximum privacy spend: providing a set of results to the client device in response to the performed query; and updating the cumulative privacy spend by incrementing the cumulative privacy spend by an amount equal to the determined privacy spend; and in response to the sum of the cumulative privacy spend and the determined privacy spend being equal to or greater than the maximum privacy spend: accessing a security policy associated with the privacy budget; and performing a security action based on the accessed security policy and the received request.
 20. A method comprising: receiving, by a privacy device, a request from a client device to perform a query of a private database system, the request associated with a level of differential privacy; accessing, by the privacy device, a privacy budget corresponding to the received request, the privacy budget including a cumulative privacy spend and a maximum privacy spend, the cumulative privacy spend representative of previous queries of the private database system; determining, by the privacy device, a privacy spend associated with the received request based at least in part on the level of differential privacy associated with the received request; in response to the sum of the cumulative privacy spend and the determined privacy spend being less than the maximum privacy spend: providing, by the privacy device, a set of results to the client device in response to the performed query; and updating, by the privacy device, the cumulative privacy spend by incrementing the cumulative privacy spend by an amount equal to the determined privacy spend; and in response to the sum of the cumulative privacy spend and the determined privacy spend being equal to or greater than the maximum privacy spend: accessing, by the privacy device, a security policy associated with the privacy budget; and performing, by the privacy device, a security action based on the accessed security policy and the received request. 